The Minimum Distance of the Binary Quadratic Residue Code

نویسندگان

  • Nigel Boston
  • Doug Kuhlman
چکیده

We find that the minimum distance of the binary [137; 69] quadratic residue code is 21.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Pless Construction and ML Decoding of the Quadratic Residue Code

We present a method for maximumlikelihood decoding of the quadratic residue code This method is based on projecting the code onto a subcode with an acyclic Tanner graph and representing the set of coset leaders by a trellis diagram This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule We show that unlike the Golay code the code does no...

متن کامل

On the Minimum Distance of Some Families of Z2k-Linear Codes

With the help of a computer, we obtain the minimum distance of some codes belonging to two families of Z2k -linear codes: the first is the generalized Kerdock codes which aren’t as good as the best linear codes and the second is the Hensel lift of quadratic residue codes. In the latter, we found new codes with same minimum distances as the best linear codes of same length and same cardinality. ...

متن کامل

On the Pless-construction and ML decoding of the (48, 24, 12) quadratic residue code

We present a method for maximumlikelihood decoding of the (48; 24; 12) quadratic residue code. This method is based on projecting the code onto a subcode with an acyclic Tanner graph, and representing the set of coset leaders by a trellis diagram. This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule. We show that unlike the code does ...

متن کامل

Discovery of good double and triple circulant codes using multiple impulse method

Introduction The design of good codes is of fundamental importance in a communication system. Furthermore, finding good linear or nonlinear codes may affect the sphere packing problems in Euclidean spaces [1]. When the code rate is 1/2 or 1/3; Double or Triple Circulant Codes (DCC & TCC) have been an interesting family of codes with high minimum distances. It is still hard to determine the mini...

متن کامل

The extended quadratic residue code is the only (48, 24, 12) self-dual doubly-even code

The largest minimum weight of a self-dual doubly-even binary (n, k, d) code is d = 4bn/24c+ 4. Of such codes with length divisible by 24, the Golay Code is the only (24, 12, 8) code, the Extended Quadratic Residue Code is the only known (48, 24, 12) code, and there is no known (72, 36, 16) code. One may partition the search for a (48, 24, 12) self-dual doubly-even code into 3 cases. A previous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999